Improved distinguishers for HC-128

نویسندگان

  • Paul Stankovski
  • Sushmita Ruj
  • Martin Hell
  • Thomas Johansson
چکیده

HC-128 is an eSTREAM final portfolio stream cipher. Several authors have investigated its security and, in particular, distinguishing attacks have been considered. Still, no one has been able to provide a distinguisher stronger than the one presented by Wu in the original HC128 paper. In this paper we first argue that the keystream requirement in Wu’s original attack is underestimated by a factor of almost 2. Our revised analysis shows that the keystream complexity of Wu’s original attack is 2 32-bit keystream blocks. We then go on to investigate two new types of distinguishers on HC-128. One of them, a distinguisher counting the number of zeros in created blocks of bits, gives a biased distribution that requires 2 such constructed block samples (2 32-bit keystream blocks). For fairness, the same metric is used to compare our attack to Wu’s, and our improvement is significant compared to Wu’s original result. Furthermore, the vector-based methodology used is general and can be applied to any cryptographic primitive that reveals a suitable probability distribution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Distinguishing Attacks on HC-256

The software-efficient stream cipher HC-256 was proposed by Wu at FSE 2004. Due to its impressive performance, the cipher was also a well-received entrant to the ECRYPT eSTREAM competition. The closely related stream cipher HC-128, also designed by Wu, went on to find a place in the final portfolio of the eSTREAM contest. The cipher HC-256 is word-oriented, with 32 bits in each word, and uses a...

متن کامل

Improved Integral Attacks on Rijndael with Large Blocks

In this paper, we present some improved integral attacks on Rijndael whose block sizes are larger than 128 bits. We will introduce some 4-round distinguishers for Rijndael with large blocks proposed by Marine Minier (AFRICACRYPT 2009), and propose a new 4th-order 4-round distinguisher for Rijndael-192. Basing on these distinguishers, together with the partial sum technique proposed by Niels Fer...

متن کامل

Greedy Distinguishers and Nonrandomness Detectors

We present the concept of greedy distinguishers and show how some simple observations and the well known greedy heuristic can be combined into a very powerful strategy (the Greedy Bit Set Algorithm) for efficient and systematic construction of distinguishers and nonrandomness detectors. We show how this strategy can be applied to a large array of stream and block ciphers, and we show that our m...

متن کامل

Some observations on HC-128

In this paper, we use linear approximations of the addition modulo 2 of three n-bit integers to identify linear approximations of g1, g2, the feedback functions of HC-128. This, in turn, shows that the process of keystream output generation of HC-128 can be well approximated by linear functions. In this direction, we show that the “least significant bit” based distinguisher (presented by the de...

متن کامل

Structural Evaluation by Generalized Integral Property

In this paper, we show structural cryptanalyses against two popular networks, i.e., the Feistel Network and the Substitute-Permutation Network (SPN). Our cryptanalyses are distinguishing attacks by an improved integral distinguisher. The integral distinguisher is one of the most powerful attacks against block ciphers, and it is usually constructed by evaluating the propagation characteristic of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2012